Uncovered nodes and 3-cycles in tournaments
نویسنده
چکیده
Let c(Tn) denote the number of 3-cycles in the tournament Tn and let u(Tn) denote the number of nodes i in Tn such that each arc oriented towards i belongs to at least one 3-cycle. We determine the minimum value of c(Tn) when u(Tn) = n and the maximum value of c(Tn) when u(Tn) = 3.
منابع مشابه
Multipartite tournaments with small number of cycles
L. Volkmann, Discrete Math. 245 (2002) 19-53 posed the following question. Let 4 ≤ m ≤ n. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n − m + 1 cycles of length m? We answer this question in affirmative. We raise the following problem. Given m ∈ {3, 4, . . . , n}, find a characterization of strong n-partite tournaments having exactly n −m + 1 cycle...
متن کاملWeakly Complementary Cycles in 3-Connected Multipartite Tournaments
The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjoint cycles C1 and C2 such that V (D) = V (C1) ∪ V (C2), and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles C1 and C2 such that V (C1) ∪ V (C2...
متن کاملPaths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.
متن کاملDisjoint 3 - cycles in tournaments : a proof of the 1 Bermond - Thomassen conjecture for tournaments ∗
5 We prove that every tournament with minimum out-degree at least 2k− 1 contains k disjoint 6 3-cycles. This provides additional support for the conjecture by Bermond and Thomassen that 7 every digraph D of minimum out-degree 2k − 1 contains k vertex disjoint cycles. We also prove 8 that for every > 0, when k is large enough, every tournament with minimum out-degree at least 9 (1.5+ )k contains...
متن کاملDisjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments
We prove that every tournament with minimum out-degree at least 2k− 1 contains k disjoint 3-cycles. This provides additional support for the conjecture by Bermond and Thomassen that every digraph D of minimum out-degree 2k − 1 contains k vertex disjoint cycles. We also prove that for every > 0, when k is large enough, every tournament with minimum out-degree at least (1.5+ )k contains k disjoin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 7 شماره
صفحات -
تاریخ انتشار 1993